Orthologic Desargues' figure

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An implication in orthologic

We involve a certain propositional logic based on an ortholattice. We characterize the implication reduct of such a logic and show that its algebraic counterpart is the so-called orthosemilattice. Properties of congruences and congruence kernels of these algebras are described.

متن کامل

Focusing in Orthologic

We propose new sequent calculus systems for orthologic (also known as minimal quantum logic) which satisfy the cut elimination property. The first one is a very simple system relying on the involutive status of negation. The second one incorporates the notion of focusing (coming from linear logic) to add constraints on proofs and thus to facilitate proof search. We demonstrate how to take benef...

متن کامل

Pappus-Desargues digraph confrontation

Like the Coxeter graph became reattached into the Klein graph in [3], the Levi graphs of the 93 and 103 self-dual configurations, known as the Pappus and Desargues (k-transitive) graphs P and D (where k = 3), also admit reattachments of the distance-(k − 1) graphs of half of their oriented shortest cycles via orientation assignments on their common (k−1)-arcs, concurrent for P and opposite for ...

متن کامل

Orthologic Tetrahedra with Intersecting Edges

Two tetrahedra are called orthologic if the lines through vertices of one and perpendicular to corresponding faces of the other are intersecting. This is equivalent to the orthogonality of non-corresponding edges. We prove that the additional assumption of intersecting non-corresponding edges (“orthosecting tetrahedra”) implies that the six intersection points lie on a sphere. To a given tetrah...

متن کامل

On Different Proof-Search Strategies for Orthologic

In this paper, we consider three different search strategies for a cut-free sequent system formalizing orthologic, and estimate the respective search spaces. Applying backward search, there are classes of formulae for which both the minimal proof length and the search space are exponential. In a combined forward and backward approach, all proofs are polynomial, but the potential search space re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society

سال: 1979

ISSN: 1446-7887,1446-8107

DOI: 10.1017/s1446788700012234